Garbage Collection in Distributed Object Systems
نویسندگان
چکیده
Large-scale, distributed computer systems are less reliable than their smallscale, non-distributed counterparts. A significant proportion of the reliability problems are due to the very poor scalability of manual storage management techniques—the reclamation of unused storage in particular. The bulk of automatic garbage reclamation in both message-passing and shared memory systems, with certain realistic assumptions, can be implemented in a generic, language-independent, low-overhead, fault-tolerant manner that is largely transparent to the programmer. Using such automatic mechanisms reduces the burden of storage management drastically, resulting in applications which are smaller, more reliable, and much easier to understand and maintain.
منابع مشابه
Mosaic: A Non-Intrusive Complete Garbage Collector for DSM System
Little work has been done in garbage collection algorithms for distributed shared memory systems. Mosaic is a safe and complete garbage collection system that collects garbage in object systems that are implemented above page-based distributed shared memory systems. It is non-intrusive in its impact on application performance. Mosaic partitions the virtual address space into separately managed ...
متن کاملAn implementation of complete , asynchronous , distributed garbage collectionFabrice
Most existing reference-based distributed object systems include some kind of acyclic garbage collection, but fail to provide acceptable collection of cyclic garbage. Those that do provide such GC currently suuer from one or more problems: synchronous operation, the need for expensive global consensus or termination algorithms, susceptibility to communication problems, or an algorithm that does...
متن کاملDistributed Garbage Collection by Timeouts and Backward Inquiry
We present a practical and e cient garbage collection mechanism for large scale distributed systems The mechanism collects all garbage including distributed cyclic garbage without global synchronization or back ward links The primary method used for local and remote garbage collection is timeouts each object has a time to live and clients which have a link to an ob ject must refresh the target ...
متن کاملAn Implementation of Complete, Asynchronous, Distributed Garbage Collection
Most existing reference-based distributed object systems include some kind of acyclic garbage collection, but fail to provide acceptable collection of cyclic garbage. Those that do provide such GC currently suuer from one or more problems: synchronous operation, the need for expensive global consensus or termination algorithms, susceptibility to communication problems, or an algorithm that does...
متن کامل4.2 Improvement of Eciency 5 Problems and Its Solution 5.1 Specifying Groups 5.2 Unpredictable Cycles
Reference counting schemes are suitable for garbage collection on distributed systems because they do not require global information to nd garbage. However, reference counting schemes have a serious drawback: they cannot reclaim garbage which form cyclic structures. In this paper, we propose an extension of the traditional reference counting scheme, group reference counting, which alleviates th...
متن کاملDistributed Garbage Collection in a Middleware for Mobile Applications
A middleware for object-oriented software systems which provides for transparent remote method invocation and transparent object mobility may require a very flexible object reference model. Distributed garbage collection algorithms, on the other hand, rely on simple object reference models, either to count object references or to traverse object references to mark unreachable objects. Thus, imp...
متن کامل